On the Performance of Congestion Games for Optimum Satisfiability Problems
نویسندگان
چکیده
We introduce and study a congestion game having max sat as an underlying structure and show that its price of anarchy is 1/2. The main result is a redesign of the game leading to an improved price of anarchy of 2/3 from which we derive a non oblivious local search algorithm for max sat with locality gap 2/3. A similar congestion min sat game is also studied. keywords: price of anarchy, non oblivious local search, approximation algorithm, max sat
منابع مشابه
Application of Particle Swarm Optimization and Genetic Algorithm Techniques to Solve Bi-level Congestion Pricing Problems
The solutions used to solve bi-level congestion pricing problems are usually based on heuristic network optimization methods which may not be able to find the best solution for these type of problems. The application of meta-heuristic methods can be seen as viable alternative solutions but so far, it has not received enough attention by researchers in this field. Therefore, the objective of thi...
متن کاملYard Crane Pools and Optimum Layouts for Storage Yards of Container Terminals
As more and more container terminals open up all over the world, competition for business is becoming very intense for container terminal operators. They are finding out that even to keep their existing Sea Line customers, they have to make them happy by offering higher quality service. The quality of service they can provide depends on their operating policies and the design of the terminal la...
متن کاملDetect and Eliminate Congestion of the Intermediate Products in Supply Chain
Data envelopment analysis (DEA) is a nonparametric technique that includes models to evaluate the relative efficiency of Decision Making Units (DMUs). It has the ability to separate efficient units and inefficient units. One of the applications of this mathematical technique is evaluating performance of supply chain. According to such as the inefficiency factors of one DMU, is existence conges...
متن کاملOptimum Proposal of Various Financial Rights in Secondary Short-Period Auction Market of Transmission Rights for Congestion Risk Management
Congestion Risk Management is one of the most important subjects of Transmission management in deregulated power system and world electricity market, especially markets of zonal or local pricing in which Firm Transmission Rights (in other words Financial Transmission Rights) are the main elements. In this study, considering subjects of Financial Rights of Transmission Congestion, methods of opt...
متن کاملMaximum Congestion Games on Networks: How Can We Compute Their Equilibria?
We study Network Maximum Congestion Games, a class of network games where players choose a path between two given nodes in order to minimize the congestion of the bottleneck (the most congested link) of their path. For single-commodity games, we provide an algorithm which computes a Pure Nash Equilibrium in polynomial time. If all players have the same weight, the obtained equilibrium has optim...
متن کامل